منابع مشابه
Mean oscillation of functions
The oscillatory behavior of functions with compactly supported Fourier transform is characterized in a quantiied way using various function spaces. In particular, the results in this paper show that the oscillations of a function at large scale are comparable to the oscillations of its samples on an appropriate discrete set of points. Several open questions about spaces of sequences are answere...
متن کاملVector Valued Measures of Bounded Mean Oscillation
The duality between Hl and BMO, the space of functions of bounded mean oscillation (see [JN]), was first proved by C. Fefferman (see [F], [FS]) and then other proofs of it were obtained . Using the atomic decomposition approach ([C], [L]) the author studied the problem of characterizing the dual space of Hl of vector-valued functions . In [B2] the author showed, for the case SZ = {Iz1 = 1}, tha...
متن کاملConstructive Decomposition of Functions of Finite Central Mean Oscillation
The space CMO of functions of finite central mean oscillation is an analogue of BMO where the condition that the sharp maximal function is bounded is replaced by the convergence of the sharp function at the origin. In this paper it is shown that each element of CMO is a singular integral image of an element of the Beurling space B2 of functions whose Hardy-Littlewood maximal function converges ...
متن کاملHyperbolic Mean Growth of Bounded Holomorphic Functions in the Ball
We consider the hyperbolic Hardy class %Hp(B), 0 < p < ∞. It consists of φ holomorphic in the unit complex ball B for which |φ| < 1 and sup 0<r<1 ∫ ∂B {%(φ(rζ), 0)} dσ(ζ) < ∞, where % denotes the hyperbolic distance of the unit disc. The hyperbolic version of the Littlewood-Paley type g-function and the area function are defined in terms of the invariant gradient of B, and membership of %Hp(B) ...
متن کاملBounded-oscillation Pushdown Automata
We present an underapproximation for context-free languages by filtering out runs of the underlying pushdown automaton depending on how the stack height evolves over time. In particular, we assign to each run a number quantifying the oscillating behavior of the stack along the run. We study languages accepted by pushdown automata restricted to k-oscillating runs. We relate oscillation on pushdo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2006
ISSN: 1027-5487
DOI: 10.11650/twjm/1500403848